Definition of Pumping lemma

1. Noun. (computer science) A lemma which states that for a language to be a member of a language class any sufficiently long string in the language contains a section that can be removed or repeated any number of times with the resulting string remaining in the language, used to determine if a particular language is in a given language class (e.g. not regular). ¹

¹ Source: wiktionary.com

Lexicographical Neighbors of Pumping Lemma

pumped(p)
pumped-up
pumped-up(a)
pumped up
pumped up(p)
pumpellyite
pumpellyites
pumper
pumpernickel
pumpernickels
pumpers
pumphood
pumphoods
pumping
pumping iron
pumping lemma
pumping lemmas
pumping lemmata
pumping station
pumping up
pumpion
pumpions
pumpjack
pumpjacks
pumpjet
pumpjets
pumpkin
pumpkin-shaped
pumpkin ash
pumpkin head

Other Resources:

Search for Pumping lemma on Dictionary.com!Search for Pumping lemma on Thesaurus.com!Search for Pumping lemma on Google!Search for Pumping lemma on Wikipedia!

Search